Spatial synthesis by disjunctive constraint satisfaction
نویسندگان
چکیده
منابع مشابه
Spatial synthesis by disjunctive constraint satisfaction
The spatial synthesis problem addressed in this paper is the configuration of rectangles in 2D space, where the sides of the rectangles are parallel to an orthogonal coordinate system. Variables are the locations of the edges of the rectangles and their orientations. Algebraic constraints on these variables define a layout and constitute a constraint satisfaction problem. We give a new O(n) alg...
متن کاملA Method for Disjunctive Constraint Satisfaction
A distinctive property of many current grammatical formalisms is their use of feature equal ity constraints to express a wide variety of grammatical dependencies Lexical Functional Grammar Head Driven Phrase Structure Grammar PATR FUG and the various forms of categorial uni cation grammar all require an analysis of a sentence to satisfy a collection of feature constraints in addition to a set o...
متن کاملPartial Constraint Satisfaction of Disjunctive Temporal Problems
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy a maximal number of constraints. While partial constraint satisfaction (PCS) has been commonly applied to finite-domain CSPs, its application in this setting is of particular interest, as temporal problems are tradition...
متن کاملUsing Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many areas of artificial intelligence, from planning to natural language understanding. A new method is proposed for decomposing constraint satisfaction problems using inferred disjunctive constraints. The decomposition re...
متن کاملHierarchical Constraint Satisfaction in Spatial Databases
Several content-based queries in spatial databases and geographic information systems (GISs) can be modelled and processed as constraint satisfaction problems (CSPs). Regular CSP algorithms, however, work for main memory retrieval without utilizing indices to prune the search space. This paper shows how systematic and local search techniques can take advantage of the hierarchical decomposition ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence for Engineering Design, Analysis and Manufacturing
سال: 1997
ISSN: 0890-0604,1469-1760
DOI: 10.1017/s0890060400003206